Introduction
Insertion Sort
Insertion Sort Analysis
Asymptotic Notations-1
Asymptotic Notations 2, Merge Sort-1
Merge Sort-2
Merge Sort Analysis; Max Subarray-1
Max Subarray-2
Max Subarray-3; Strassen's Algorithm -1
Strassen's Algorithm-2; solving-recurrences-1
Solving Recurrences-2
Heap Sort
Heap Sort analysis
Priority Queues
Quick Sort
Quick Sort Analysis
Randomized Quick-Sort
Randomized Quick-Sort analysis and LowerBound
Counting Sort
Radix Sort and Bucket-Sort
Bucket-Sort Analysis
Dynamic-Programming-Rod-Cutting
DP-Rod-Cutting-02
DP-Matrix-Chain
DP-Matrix-Chain-02
Matrix-Chain-03-LCS-01
LCS-02
contd-LCS-03
Greedy-Activity-Selector-01
Greedy-Activity-Selector-02
Greedy-Activity-Selector-03
Elements of Greedy Strategy
Greedy-Huffman-Codes-01
Greedy-Huffman-Codes-02
Greedy-Huffman-03
Graphs-Introduction and BFS-01
BFS-02-DFS-01
DFS-2
Topological-Sort-01
Topological-Sort-02
Minimum Spanning Tree
Shortest-Path-Introduction-01
Shortest-Path-Introduction-02
Bellman-Ford Algorithm
Dijkstra Algorithm and All-Pairs-Introduction
Floyd-Warshall Algorithm
String-Matching-Naïve Algorithm
KMP Algorithm
Rabin-Karp String Matching Algorithm
Revision-01
Revision-02
Revision-03
Revision-04
